Parallelism and Concurrency of Stochastic Graph Transformations
نویسندگان
چکیده
Graph transformation systems (GTS) have been proposed for high-level stochastic modelling of dynamic systems and networks. The resulting systems can be described as semi-Markov processes with graphs as states and transformations as transitions. The operational semantics of such processes can be explored through stochastic simulation. In this paper, we develop the basic theory of stochastic graph transformation, including generalisations of the Parallelism and Concurrency Theorems and their application to computing the completion time of a concurrent process.
منابع مشابه
R I T D-p A G T
Studying parallelism and concurrency in the double-pushout approach to graph transformations is mainly based on the so-called triple-pushout condition. The categories of sets and of graphs satisfy this condition. If we, however, consider graph morphisms that may change the labels in a welldefined manner (structurally labeled graphs), the triple-pushout condition does no longer hold true. In thi...
متن کاملStrategies for the efficient exploitation of loop-level parallelism in Java
This paper analyzes the overheads incurred in the exploitation of loop-level parallelism using Java Threads and proposes some code transformations that minimize them. The transformations avoid the intensive use of Java Threads and reduce the number of classes used to specify the parallelism in the application (which reduces the time for class loading). The use of such transformations results in...
متن کاملHPVM: A Portable Virtual Instruction Set for Heterogeneous Parallel Systems
We describe a programming abstraction for heterogeneous parallel hardware, designed to capture a wide range of popular parallel hardware, including GPUs, vector instruction sets and multicore CPUs. Our abstraction, which we call HPVM , is a hierarchical dataflow graph with shared memory and vector instructions. We use HPVM to define both a virtual instruction set (ISA) and also a compiler inter...
متن کاملDGCC: A New Dependency Graph based Concurrency Control Protocol for Multicore Database Systems
Multicore CPUs and large memories are increasingly becoming the norm in modern computer systems. However, current database management systems (DBMSs) are generally ineffective in exploiting the parallelism of such systems. In particular, contention can lead to a dramatic fall in performance. In this paper, we propose a new concurrency control protocol called DGCC (Dependency Graph based Concurr...
متن کاملDemystifying Parallel and Distributed Deep Learning: An In-Depth Concurrency Analysis
DeepNeural Networks (DNNs) are becoming an important tool inmodern computing applications. Accelerating their training is a major challenge and techniques range from distributed algorithms to low-level circuit design. In this survey, we describe the problem from a theoretical perspective, followed by approaches for its parallelization. Specifically, we present trends in DNN architectures and th...
متن کامل